Quantum lower bound for recursive Fourier sampling
نویسندگان
چکیده
منابع مشابه
Quantum lower bound for recursive fourier sampling
We revisit the oft-neglected ‘recursive Fourier sampling’ (RFS) problem, introduced by Bernstein and Vazirani to prove an oracle separation between BPP and BQP. We show that the known quantum algorithm for RFS is essentially optimal, despite its seemingly wasteful need to uncompute information. This implies that, to place BQP outside of PH [log] relative to an oracle, one needs to go outside th...
متن کاملInteractive proofs with efficient quantum prover for recursive Fourier sampling
We consider the recursive Fourier sampling problem (RFS), and show that there exists an interactive proof for RFS with an efficient classical verifier and efficient quantum prover.
متن کاملThe Polynomial Degree of Recursive Fourier Sampling
We present matching upper and lower bounds for the “weak” polynomial degree of the recursive Fourier sampling problem from quantum complexity theory. The degree bound is h+ 1, where h is the order of recursion in the problem’s definition, and this bound is exponentially lower than the bound implied by the existence of a BQP algorithm for the problem. For the upper bound we exhibit a degree-h + ...
متن کاملQuantum lower bound for sorting ∗
Needless to say, sorting, especially sorting by comparisons, has been a classical problem in computer science. Despite its enormous importance, the complexity, in terms of the number of comparisons needed, is simple to analyze. Straightforward information theoretical argument gives the tight lower bound of log2(n!), which is achieved by several simple sorting algorithms, for example, Insertion ...
متن کاملA sampling lower bound for permutations
A map f : [n]` → [n]n has locality d if each output symbol in [n] = {1, 2, . . . , n} depends only on d of the ` input symbols in [n]. We show that the output distribution of a d-local map has statistical distance at least 1−2 · exp(−n/ logcd n) from a uniform permutation of [n]. This seems to be the first lower bound for the well-studied problem of generating permutations. Because poly(n)-size...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2003
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic3.2-7